package cn.hy.today;

import java.util.HashMap;
import java.util.Map;

class Solution_447 {
    public int numberOfBoomerangs(int[][] points) {
        int ans = 0;
        for (int[] p : points) {
            Map<Integer, Integer> cntMap = new HashMap<>();
            for (int[] q : points) {
                int dist = (p[0] - q[0]) * (p[0] - q[0]) + (p[1] - q[1]) * (p[1] - q[1]);
                cntMap.put(dist, cntMap.getOrDefault(dist, 0) + 1);
            }
            for (Map.Entry<Integer, Integer> entry : cntMap.entrySet()) {
                Integer value = entry.getValue();
                ans += value * (value - 1);
            }
        }
        return ans;
    }


    public static void main(String[] args) {
        System.out.println(-1 * -1);
    }
}